Search results for "Hausdorff distance"

showing 10 items of 37 documents

A quantitative reverse Faber-Krahn inequality for the first Robin eigenvalue with negative boundary parameter

2021

The aim of this paper is to prove a quantitative form of a reverse Faber-Krahn type inequality for the first Robin Laplacian eigenvalueλβwith negative boundary parameter among convex sets of prescribed perimeter. In that framework, the ball is the only maximizer forλβand the distance from the optimal set is considered in terms of Hausdorff distance. The key point of our stategy is to prove a quantitative reverse Faber-Krahn inequality for the first eigenvalue of a Steklov-type problem related to the original Robin problem.

Control and Optimizationconvex setsBoundary (topology)variaatiolaskenta01 natural sciencesSet (abstract data type)Perimeter0103 physical sciencesquantitative isoperimetric inequalityConvex setBall (mathematics)0101 mathematicsEigenvalues and eigenvectorsMathematicsosittaisdifferentiaaliyhtälötominaisarvot010102 general mathematicsMathematical analysisRegular polygonMathematics::Spectral Theorymatemaattinen optimointiQuantitative isoperimetric inequalityComputational MathematicsHausdorff distanceControl and Systems EngineeringRobin eigenvalue010307 mathematical physicsLaplace operator
researchProduct

Hausdorff measures and dimension

1995

CombinatoricsHausdorff distancePacking dimensionHausdorff dimensionMinkowski–Bouligand dimensionDimension functionHausdorff measureOuter measureEffective dimensionMathematics
researchProduct

Weakly controlled Moran constructions and iterated functions systems in metric spaces

2011

We study the Hausdorff measures of limit sets of weakly controlled Moran constructions in metric spaces. The separation of the construction pieces is closely related to the Hausdorff measure of the corresponding limit set. In particular, we investigate different separation conditions for semiconformal iterated function systems. Our work generalizes well known results on self-similar sets in metric spaces as well as results on controlled Moran constructions in Euclidean spaces.

Pure mathematicsClosed set28A8028A80 28A78 (Primary); 37C45 (Secondary)General MathematicsHausdorff dimensionDynamical Systems (math.DS)Hausdorff measureCombinatoricsopen set conditionsemikonforminen iteroitu funktiojärjestelmäsemiconformal iterated function systemFOS: Mathematics37C45 (Secondary)Hausdorff measureHausdorff-ulottuvuusMathematics - Dynamical SystemsHausdorffin mittaMathematicsball condition37C45avoimen joukon ehtoMoran-konstruktiofinite clustering propertyInjective metric spaceHausdorff spaceMoran constructionäärellinen pakkautuminenConvex metric space28A80 28A78 (Primary)Metric spaceHausdorff distance28A78palloehtoNormal space
researchProduct

3D segmentation of abdominal aorta from CT-scan and MR images

2012

International audience; We designed a generic method for segmenting the aneurismal sac of an abdominal aortic aneurysm (AAA) both from multi-slice MR and CT-scan examinations. It is a semi-automatic method requiring little human intervention and based on graph cut theory to segment the lumen interface and the aortic wall of AAAs. Our segmentation method works independently on MRI and CT-scan volumes and has been tested on a 44 patient dataset and 10 synthetic images. Segmentation and maximum diameter estimation were compared to manual tracing from 4 experts. An inter-observer study was performed in order to measure the variability range of a human observer. Based on three metrics (the maxim…

CT scanmedicine.medical_specialty[INFO.INFO-IM] Computer Science [cs]/Medical ImagingLumen (anatomy)Health Informatics02 engineering and technologyAAA segmentationPattern Recognition Automated030218 nuclear medicine & medical imaging03 medical and health sciencesAortic aneurysmImaging Three-Dimensional0302 clinical medicineCutmedicine.arteryImage Interpretation Computer-Assisted[INFO.INFO-IM]Computer Science [cs]/Medical Imaging0202 electrical engineering electronic engineering information engineeringmedicineHumansRadiology Nuclear Medicine and imagingSegmentationMathematicsAnalysis of VarianceRadiological and Ultrasound Technology[ INFO.INFO-IM ] Computer Science [cs]/Medical ImagingVolume segmentationAbdominal aortaReproducibility of Resultsmedicine.diseaseComputer Graphics and Computer-Aided DesignAbdominal aortic aneurysmHausdorff distancecardiovascular system020201 artificial intelligence & image processingComputer Vision and Pattern RecognitionTomographyRadiologyTomography X-Ray ComputedAlgorithmsMagnetic Resonance AngiographyGraph cutAortic Aneurysm AbdominalMRI
researchProduct

Visible parts and dimensions

2003

We study the visible parts of subsets of n-dimensional Euclidean space: a point a of a compact set A is visible from an affine subspace K of n, if the line segment joining PK(a) to a only intersects A at a (here PK denotes projection onto K). The set of all such points visible from a given subspace K is called the visible part of A from K. We prove that if the Hausdorff dimension of a compact set is at most n−1, then the Hausdorff dimension of a visible part is almost surely equal to the Hausdorff dimension of the set. On the other hand, provided that the set has Hausdorff dimension larger than n−1, we have the almost sure lower bound n−1 for the Hausdorff dimensions of visible parts. We al…

Applied MathematicsMathematical analysisMinkowski–Bouligand dimensionMathematics::General TopologyGeneral Physics and AstronomyDimension functionStatistical and Nonlinear PhysicsUrysohn and completely Hausdorff spacesEffective dimensionCombinatoricsPacking dimensionHausdorff distanceHausdorff dimensionMathematics::Metric GeometryHausdorff measureMathematical PhysicsMathematicsNonlinearity
researchProduct

High Precision Conservative Surface Mesh Generation for Swept Volumes

2015

We present a novel, efficient, and flexible scheme to generate a high-quality mesh that approximates the outer boundary of a swept volume. Our approach comes with two guarantees. First, the approximation is conservative, i.e., the swept volume is enclosed by the generated mesh. Second, the one-sided Hausdorff distance of the generated mesh to the swept volume is upper bounded by a user defined tolerance. Exploiting this tolerance the algorithm generates a mesh that is adapted to the local complexity of the swept volume boundary, keeping the overall output complexity remarkably low. The algorithm is two-phased: the actual sweep and the mesh generation. In the sweeping phase, we introduce a g…

Computer scienceBoundary (topology)Parallel computingUpper and lower boundsComputational scienceCUDAHausdorff distanceEngine displacementControl and Systems EngineeringMesh generationBounded functionElectrical and Electronic EngineeringRuppert's algorithmComputingMethodologies_COMPUTERGRAPHICSIEEE Transactions on Automation Science and Engineering
researchProduct

Conservative swept volume boundary approximation

2010

We present a novel technique for approximating the boundary of a swept volume. The generator given by an input triangle mesh is rendered under all rigid transformations of a discrete trajectory. We use a special shader program that creates offset geometry of each triangle on the fly, thus guaranteeing a conservative rasterization and correct depth values. Utilizing rasterization mechanisms and the depth buffer we then get a conservative voxelization of the swept volume (SV) and can extract a triangle mesh from its surface. This mesh is simplified maintaining conservativeness as well as an error bound measured in terms of the one-sided Hausdorff distance. For this we introduce a new techniqu…

Engine displacementOffset (computer science)Hausdorff distanceTriangle meshVolume computationTopologyTexture memoryAlgorithmShaderRigid transformationComputingMethodologies_COMPUTERGRAPHICSMathematicsProceedings of the 14th ACM Symposium on Solid and Physical Modeling
researchProduct

On multivalued weakly Picard operators in partial Hausdorff metric spaces

2015

We discuss multivalued weakly Picard operators on partial Hausdorff metric spaces. First, we obtain Kikkawa-Suzuki type fixed point theorems for a new type of generalized contractive conditions. Then, we prove data dependence of a fixed points set theorem. Finally, we present sufficient conditions for well-posedness of a fixed point problem. Our results generalize, complement and extend classical theorems in metric and partial metric spaces.

multivalued operatorDiscrete mathematicsApplied MathematicsInjective metric spacedata dependencepartial metric spaceFixed-point theoremEquivalence of metricsConvex metric spaceIntrinsic metricMetric spaceHausdorff distancefixed pointSettore MAT/05 - Analisi MatematicaMetric (mathematics)Geometry and TopologyMathematicsFixed Point Theory and Applications
researchProduct

Automatic segmentation of the spine by means of a probabilistic atlas with a special focus on ribs suppression. Preliminary results

2015

Spine is a structure commonly involved in several prevalent diseases. In clinical diagnosis, therapy, and surgical intervention, the identification and segmentation of the vertebral bodies are crucial steps. However, automatic and detailed segmentation of vertebrae is a challenging task, especially due to the proximity of the vertebrae to the corresponding ribs and other structures such as blood vessels. In this study, to overcome these problems, a probabilistic atlas of the spine, including cervical, thoracic and lumbar vertebrae has been built to introduce anatomical knowledge in the segmentation process, aiming to deal with overlapping gray levels and the proximity to other structures. F…

Malemusculoskeletal diseasesmedicine.medical_specialtyIMAGESRibsLumbar vertebraecomputer.software_genreTECNOLOGIA ELECTRONICAImaging Three-DimensionalAtlas (anatomy)VoxelmedicineHumansSegmentationRib cageGround truthModels StatisticalCONSTRUCTIONbusiness.industryPattern recognitionmusculoskeletal systemSpinemedicine.anatomical_structureHausdorff distanceFemaleRadiologyArtificial intelligencebusinesscomputerTest data2015 37th Annual International Conference of the IEEE Engineering in Medicine and Biology Society (EMBC)
researchProduct

Comments on the paper "COINCIDENCE THEOREMS FOR SOME MULTIVALUED MAPPINGS" by B. E. RHOADES, S. L. SINGH AND CHITRA KULSHRESTHA

2011

The aim of this note is to point out an error in the proof of Theorem 1 in the paper entitled “Coincidence theorems for some multivalued mappings” by B. E. Rhoades, S. L. Singh and Chitra Kulshrestha [Internat. J. Math. & Math. Sci., 7 (1984), 429-434], and to indicate a way to repair it.

Hausdorff distanceSettore MAT/05 - Analisi MatematicaMultivalued mappingCoincidence point
researchProduct